Accepted Elasticity in Local Arithmetic Congruence Monoids
نویسندگان
چکیده
For certain a, b ∈ N, the Arithmetic Congruence Monoid M(a, b) is a multiplicatively closed subset of N given by {x ∈ N : x ≡ a (mod b)}∪{1}. An irreducible in this monoid is any element that cannot be factored into two elements, each greater than 1. Each monoid element (apart from 1) may be factored into irreducibles in at least one way. The elasticity of a monoid element (apart from 1) is the length of the longest factorization into irreducibles, divided by the length of the shortest factorization into irreducibles. The elasticity of the monoid is the supremum of the elasticities of the monoid elements. A monoid has accepted elasticity if there is some monoid element that has the same elasticity as the monoid. An Arithmetic Congruence Monoid is local if gcd(a, b) is a prime power (apart from 1). It has already been determined whether Arithmetic Congruence Monoids have accepted elasticity in the non-local case; we make make significant progress in the local case, i.e. for many values of a, b. 2010 Mathematics Subject Classification: Primary 20M14; Secondary 20D60, 13F05.
منابع مشابه
A Theorem on Accepted Elasticity in Local Arithmetical Congruence Monoids
We give necessary and sufficient conditions for a certain class of local arithmetical congruence monoids (or ACMs) to have accepted elasticity. Let a and b be positive integers with a ≤ b and a ≡ a (mod b). Under these conditions, the arithmetic sequence a, a+ b, a+ 2b, a+ 3b, . . . is closed under multiplication and is a multiplicative semigroup. Setting M(a, b) = {a+ kb | k ∈ N0} ∪ {1} produc...
متن کاملA Theorem on Accepted Elasticity in Certain Local Arithmetical Congruence Monoids
We give necessary and sufficient conditions for a certain class of local arithmetical congruence monoids (or ACMs) to have accepted elasticity. Let a and b be positive integers with a ≤ b and a ≡ a (mod b). Under these conditions, the arithmetic sequence a, a+ b, a+ 2b, a+ 3b, . . . is closed under multiplication and is a multiplicative semigroup. Setting M(a, b) = {a+ kb | k ∈ N0} ∪ {1} produc...
متن کاملArithmetic of Congruence Monoids
Let N represent the positive integers. Let n ∈ N and Γ ⊆ N. Set Γn = {x ∈ N : ∃y ∈ Γ, x ≡ y (mod n)} ∪ {1}. If Γn is closed under multiplication, it is known as a congruence monoid or CM. A classical result of James and Niven [15] is that for each n, exactly one CM admits unique factorization into products of irreducibles, namely Γn = {x ∈ N : gcd(x, n) = 1}. In this paper, we examine additiona...
متن کاملFactorization Properties of Congruence Monoids
Let n ∈ N, Γ ⊆ N and define Γn = {x ∈ Zn | x ∈ Γ} the set of residues of elements of Γ modulo n. If Γn is multiplicatively closed we may define the following submonoid of the naturals: HΓn = {x ∈ N | x = γ, γ ∈ Γn}∪{1} known as a congruence monoid (CM). Unlike the naturals, many CMs enjoy the property of non-unique factorization into irreducibles. This opens the door to the study of arithmetic ...
متن کاملIrreducible Factorization Lengths and the Elasticity Problem within N
A large class of multiplicative submonoids of the natural numbers is presented, which includes congruence monoids as well as numerical monoids (by isomorphism). For monoids in this class, the important factorization property of finite elasticity is characterized.
متن کامل